Partial Orders, Event Structures and Linear Strategies

نویسندگان

  • Claudia Faggian
  • Mauro Piccolo
چکیده

We introduce a Game Semantics where strategies are partial orders, and composition is a generalization of the merging of orders. Building on this, to bridge between Game Semantics and Concurrency, we explore the relation between Event Structures and Linear Strategies. The former are a true concurrency model introduced by Nielsen, Plotkin, Winskel, the latter a family of linear innocent strategies developed starting from Girard’s work in the setting of Ludics. We extend our construction on partial orders to classes of event structures, showing how to reduce composition of event structures to the simple definition of merging of orders. Finally, we introduce a compact closed category of event structures which embeds Linear Strategies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Countable homogeneous and partially homogeneous ordered structures

I survey classification results for countable homogeneous or ‘partially homogeneous’ ordered structures. This includes some account of Schmerl’s classification of the countable homogeneous partial orders, outlining an extension of this to the coloured case, and also treating results on linear orders, and their generalizations, trees and cycle-free partial orders. 2000 Mathematics Subject Classi...

متن کامل

On orders induced by implications

In this paper, the orders induced by the residual implications obtained from uninorms are investigated. A necessary and sufficient condition is presented so that the ordinal sum of fuzzy implications satisfies the law of importation with a t-norm $T$. Some relationships between the orders induced by an ordinal sum implication and its summands are determined. The algebraic structures obtained fr...

متن کامل

Searching in Random Partially Ordered Sets

We consider the problem of searching for a given element in a partially ordered set. More precisely, we address the problem of computing efficiently near-optimal search strategies for typical partial orders. We consider two classical models for random partial orders, the random graph model and the uniform model. We shall show that certain simple, fast algorithms are able to produce nearly-optim...

متن کامل

Bistructures, Bidomains and Linear Logic

Bistructures are a generalisation of event structures to represent spaces of functions at higher types; the partial order of causal dependency is replaced by two orders, one associated with input and the other output in the behaviour of functions. Bistructures form a categorical model of Girard’s classical linear logic in which the involution of linear logic is modelled, roughly speaking, by a ...

متن کامل

A Verified Algorithm Enumerating Event Structures

An event structure is a mathematical abstraction modeling concepts as causality, conflict and concurrency between events. While many other mathematical structures, including groups, topological spaces, rings, abound with algorithms and formulas to generate, enumerate and count particular sets of their members, no algorithm or formulas are known to generate or count all the possible event struct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009